Revenue Equivalence of Leveled Commitment Contracts
نویسنده
چکیده
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts i.e. contracts where each party can decommit by paying a predetermined penalty were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts differ based on whether agents have to declare their decommitting decisions sequentially or simultaneously, and whether or not agents have to pay the penalties if both decommit. For a given contract, these protocols lead to different decommitting thresholds and probabilities. However, this paper shows that, surprisingly, each protocol leads to the same expected social welfare when the contract price and penalties are optimized for each protocol. Our derivations allow agents to construct optimal leveled commitment contracts. We also show that such integrative bargaining does not hinder distributive bargaining: the excess can be divided arbitrarily (as long as each agent benefits), e.g. equally, without compromising optimality. Revenue equivalence ceases to hold if agents are not risk neutral. A contract optimization service is offered on the web as... Read complete abstract on page 2.
منابع مشابه
Revenue Equivalence of Leveled Commitment Contracts Revenue Equivalence of Leveled Commitment Contracts
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty|were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts diier based on whether agents have to declare ...
متن کاملRevenue Equivalence of Leveled CommitmentContractsTuomas
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty|were recently shown to improve expected social welfare even if agents decommit insincerely in Nash equilibrium. Such contracts diier based on whether agents have to declare ...
متن کاملSurplus Equivalence of Leveled Commitment Contracts
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts — i.e., contracts where each party can decommit by paying a predetermined penalty — were recently shown to improve expected social welfare even if agents decommit strategically in Nash equilibrium. Such contracts differ based on whether agents have to de...
متن کاملAlgorithms for Optimizing Leveled Commitment Contracts Algorithms for Optimizing Leveled Commitment Contracts
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding. Leveled commitment contracts | i.e. contracts where each party can decommit by paying a predetermined penalty | were recently shown to improve Pareto ef-ciency even if agents rationally decommit in Nash equilibrium using innated thresholds on how good their outside ooers must be bef...
متن کاملLeveled Commitment Contracts with Myopic and Strategic Agents
In automated negotiation systems consisting of self-interested agents, contracts have traditionally been binding, i.e., impossible to breach. Such contracts do not allow the agents to e$ciently deal with future events. This de"ciency can be tackled by using a leveled commitment contracting protocol which allows the agents to decommit from contracts by paying a monetary penalty to the contractin...
متن کامل